Verifying temporal properties without temporal logic
نویسندگان
چکیده
منابع مشابه
Verifying Temporal Heap Properties Specified via Evolution Logic
This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate—and deallocate—new objects and threads. Establishing liveness properties is a particularly hard challenge. One of the crucial obstacles is that heap locations have no static names and the number of heap locations is unbounded. The p...
متن کاملSpecifying and Verifying Declarative Fluent Temporal Logic Properties of Workflows
In this paper, we present a characterization of workflows as labeled transition systems, focusing on an encoding of workflow specifications based on workflow patterns. This encoding models tasks in a convenient way, enabling us to exploit fluent linear time temporal logic formulas for capturing typical constraints on workflows. Fluents enable us to flexibly characterize the activities associate...
متن کاملVerifying Temporal Properties of Processes
1 Motivation Many interesting concurrent systems have innnite state spaces: examples include concurrent while programs; Petri Nets; CCS (or CSP) processes with value passing. All of these examples can be interpreted operationally as innnite labelled transition systems, structures of the form (P; f a ?! : a 2 L g) where P is a set of points (states, markings, processes) and a ?! the appropriate ...
متن کاملVerifying Multran Programs with Temporal Logic
A coordinationstyle programminglanguage, Multran, and its temporal logic semantics are proposed. Multran uses Linda-like tuple space to coordinate concurrent transactions, which could be written in any language as long as they satisfy their preconditions and post-conditions. It has an intuitional presentation and enjoys a temporal logic semantics for program veriication. A Multran program can b...
متن کاملVerifying Network Protocols Using Temporal Logic
Programs that implement computer communications protocols can exhibit extremely complicated behavior, and neither informal reasoning nor testing is ~ reliable enough to establish their correctness. In this paper we discuss the application of program verification techniques to protocols. This approach is more reliable than informal reasoning, but has the advantage over formal reasoning based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1989
ISSN: 0164-0925,1558-4593
DOI: 10.1145/59287.62028